Procedures, parameters, and abstraction: Separate concerns
نویسندگان
چکیده
منابع مشابه
Predicate Abstraction via Symbolic Decision Procedures
We present a new approach for performing predicate abstraction based on symbolic decision procedures. Intuitively, a symbolic decision procedure for a theory takes a set of predicates in the theory and symbolically executes a decision procedure on all the subsets over the set of predicates. The result of the symbolic decision procedure is a shared expression (represented by a directed acyclic g...
متن کاملConcerns at Work: Designing Useful Procedures
The conceptual basis for designing procedures is confused by the problematics of characterising a relationship between procedures and work practices. As they emerge from scientific management theory, procedures connote a means of rationalising and controlling work. However, interpretations of the use of procedures reveal differences in emphasis on the work required to relate procedures to pract...
متن کاملColoured Petri Nets with Parallel Composition to Separate Concerns
We define a modeling language based on combining Coloured Petri Nets with Protocol Modeling semantics. This language combines the expressive power of Coloured Petri Nets in describing behavior with the ability provided by Protocol Modeling to compose partial behavioral descriptions. The resultant language can be considered as a domain specific Coloured Petri Net based language for deterministic...
متن کاملSeparation of Concerns with Procedures, Annotations, Advice and Pointcuts
There are numerous mechanisms for separation of concerns at the source code level. Three mechanisms that are the focus of recent attention – metadata annotations, pointcuts and advice – can be modeled together with good old-fashioned procedures as providing different kinds of bindings: procedure calls bind program points to operations, annotations bind attributes to program points; pointcuts bi...
متن کاملDeriving Invariants by Algorithmic Learning, Decision Procedures, and Predicate Abstraction
By combining algorithmic learning, decision procedures, and predicate abstraction, we present an automated technique for finding loop invariants in propositional formulae. Given invariant approximations derived from preand post-conditions, our new technique exploits the flexibility in invariants by a simple randomized mechanism. The proposed technique is able to generate invariants for some Lin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1988
ISSN: 0167-6423
DOI: 10.1016/0167-6423(88)90062-7